/*
 *
 *  This file is part of the SIRIUS library for analyzing MS and MS/MS data
 *
 *  Copyright (C) 2013-2020 Kai Dührkop, Markus Fleischauer, Marcus Ludwig, Martin A. Hoffman, Fleming Kretschmer and Sebastian Böcker,
 *  Chair of Bioinformatics, Friedrich-Schilller University.
 *
 *  This library is free software; you can redistribute it and/or
 *  modify it under the terms of the GNU Lesser General Public
 *  License as published by the Free Software Foundation; either
 *  version 3 of the License, or (at your option) any later version.
 *
 *  This library is distributed in the hope that it will be useful,
 *  but WITHOUT ANY WARRANTY; without even the implied warranty of
 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 *  Lesser General Public License for more details.
 *
 *  You should have received a copy of the GNU General Public License along with SIRIUS. If not, see <https://www.gnu.org/licenses/lgpl-3.0.txt>
 */

package de.unijena.bioinf.FragmentationTreeConstruction.ftheuristics;

import de.unijena.bioinf.ChemistryBase.ms.ft.FGraph;
import de.unijena.bioinf.ChemistryBase.ms.ft.FTree;
import de.unijena.bioinf.ChemistryBase.ms.ft.Fragment;

public class CriticalPathInsertionWithIsotopePeaksHeuristic extends CriticalPathInsertionHeuristic {

    public CriticalPathInsertionWithIsotopePeaksHeuristic(FGraph graph) {
        super(graph);
    }

    private FTree solutionWithSingleRoot() {
        Fragment bestFrag = null;
        for (Fragment f : graph.getRoot().getChildren()) {
            if (bestFrag==null || bestFrag.getIncomingEdge().getWeight() < f.getIncomingEdge().getWeight() ) {
                bestFrag = f;
            }
        }
        final FTree t = new FTree(bestFrag.getFormula(), bestFrag.getIonization());
        t.setTreeWeight(bestFrag.getIncomingEdge().getWeight());
        mapping.mapLeftToRight(bestFrag, t.getRoot());
        return t;
    }

}
